Galois Embedding Problems with Cyclic Quotient
نویسنده
چکیده
Let K be a cyclic Galois extension of degree p over a field F containing a primitive pth root of unity. We consider Galois embedding problems involving Galois groups with common quotient Gal(K/F ) such that corresponding normal subgroups are indecomposable Fp[Gal(K/F )]modules. For these embedding problems we prove conditions on solvability, formulas for explicit construction, and results on automatic realizability.
منابع مشابه
2 00 4 GALOIS EMBEDDING PROBLEMS WITH CYCLIC QUOTIENT OF ORDER p JÁN
Let K/F be a cyclic field extension of odd prime degree. We consider Galois embedding problems involving Galois groups with common quotient Gal(K/F ) such that corresponding normal subgroups are indecomposable Fp[Gal(K/F )]-modules. For these embedding problems we prove conditions on solvability, formulas for explicit construction, and results on automatic realizability.
متن کاملGALOIS EMBEDDING PROBLEMS WITH CYCLIC QUOTIENT OF ORDER p
Let K be a cyclic Galois extension of degree p over a field F containing a primitive pth root of unity. We consider Galois embedding problems involving Galois groups with common quotient Gal(K/F ) such that corresponding normal subgroups are indecomposable Fp[Gal(K/F )]modules. For these embedding problems we prove conditions on solvability, formulas for explicit construction, and results on au...
متن کاملM ar 2 00 6 AUTOMATIC REALIZATIONS OF GALOIS GROUPS WITH CYCLIC QUOTIENT OF ORDER p n
We establish automatic realizations of Galois groups among groups M ⋊ G, where G is a cyclic group of order p for a prime p and M is a quotient of the group ring Fp[G]. The fundamental problem in inverse Galois theory is to determine, for a given field F and a given profinite group G, whether there exists a Galois extension K/F such that Gal(K/F ) is isomorphic to G. A natural sort of reduction...
متن کاملAn improved and efficient stenographic scheme based on matrix embedding using BCH syndrome coding.
This paper presents a new stenographic scheme based on matrix embedding using BCH syndrome coding. The proposed method embeds massage into cover by changing some coefficients of cover. In this paper defining a number :::as char:::acteristic of the syndrome, which is invariant with respect to the cyclic shift, we propose a new embedding algorithm base on BCH syndrome coding, without finding ro...
متن کاملGALOIS MODULE STRUCTURE OF pTH-POWER CLASSES OF EXTENSIONS OF DEGREE p
For fields F of characteristic not p containing a primitive pth root of unity, we determine the Galois module structure of the group of pth-power classes of K for all cyclic extensions K/F of degree p. The foundation of the study of the maximal p-extensions of fields K containing a primitive pth root of unity is a group of the pth-power classes of the field: by Kummer theory this group describe...
متن کامل